Exponential-family random graph models for valued networks
نویسندگان
چکیده
منابع مشابه
Exponential-family random graph models for valued networks.
Exponential-family random graph models (ERGMs) provide a principled and flexible way to model and simulate features common in social networks, such as propensities for homophily, mutuality, and friend-of-a-friend triad closure, through choice of model terms (sufficient statistics). However, those ERGMs modeling the more complex features have, to date, been limited to binary data: presence or ab...
متن کاملExponential random graph models for multilevel networks
Modern multilevel analysis, whereby outcomes of individuals within groups take into account group membership, has been accompanied by impressive theoretical development (e.g. Kozlowski and Klein, 2000) and sophisticated methodology (e.g. Snijders and Bosker, 2012). But typically the approach assumes that links between groups are non-existent, and interdependence among the individuals derives so...
متن کاملExponential random graph models for affiliation networks
Statistical modeling of social networks as complex systems has always been and remains a challenge for social scientists. Exponential family models give us a convenient way of expressing local network structures that have sufficient statistics for their corresponding parameters. This kind of model, known as Exponential Random Graph Models (ERGMs), or p∗ models, have been developed since the 198...
متن کاملStatistical Inference for Valued-Edge Networks: Generalized Exponential Random Graph Models
Across the sciences, the statistical analysis of networks is central to the production of knowledge on relational phenomena. Because of their ability to model the structural generation of networks, exponential random graph models are a ubiquitous means of analysis. However, they are limited by an inability to model networks with valued edges. We solve this problem by introducing a class of gene...
متن کاملA Perfect Sampling Method for Exponential Family Random Graph Models
Generation of deviates from random graph models with non-trivial edge dependence is an increasingly important problem. Here, we introduce a method which allows perfect sampling from random graph models in exponential family form (“exponential family random graph” models), using a variant of Coupling From The Past. We illustrate the use of the method via an application to the Markov graphs, a fa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Statistics
سال: 2012
ISSN: 1935-7524
DOI: 10.1214/12-ejs696